Polygon stacks and time reference conversions
نویسندگان
چکیده
منابع مشابه
Reference Frame Conversions for Repeated Arm Movements Running Title: Reference Frame Conversions for Repeated Arm Movements
The aim of this study was to further understand how the brain represents spatial information for shaping aiming movements to targets. Both behavioral and neurophysiological studies have shown that the brain represents spatial memory for reaching targets in an eye-fixed frame. To date, these studies have only shown how the brain stores and updates target locations for generating a single arm mov...
متن کاملReference frame conversions for repeated arm movements.
The aim of this study was to further understand how the brain represents spatial information for shaping aiming movements to targets. Both behavioral and neurophysiological studies have shown that the brain represents spatial memory for reaching targets in an eye-fixed frame. To date, these studies have only shown how the brain stores and updates target locations for generating a single arm mov...
متن کاملThe reference phantoms: voxel vs polygon.
The International Commission on Radiological Protection (ICRP) reference male and female adult phantoms, described in Publication 110, are voxel phantoms based on whole-body computed tomography scans of a male and a female patient, respectively. The voxel in-plane resolution and the slice thickness, of the order of a few millimetres, are insufficient for proper segmentation of smaller tissues s...
متن کاملOn Finite-time Computability Preserving Conversions
A finite-time computable function is a partial function from Σ to Σ whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computability preserving conversion α : X → Y for X,Y ⊂ Σ is a bijection which preserves finite-time computability. We show that all the finite-time computability preserving conversions with the domain Σ are extended sliding b...
متن کاملPolygon Clipping and Polygon Reconstruction
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against each edge of the clipping window, usually a rectangle. As a result, new edges may be added, and existing edges may be discarded, retained, or divided. Multiple polygons may result from clipping a single polygon. Afte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: CEAS Space Journal
سال: 2020
ISSN: 1868-2502,1868-2510
DOI: 10.1007/s12567-020-00296-7